K-regular factors and semi-k-regular factors in graphs
نویسندگان
چکیده
منابع مشابه
k - factors in regular graphs and edge - connectivity
Let , m , n , r be integers such that 2 ≤ ≤ r , r ≥ 4 and m , n ≥ 0 . Suppose G is an r -regular -edge-connected graph and that k is an even integer with m ≤ k ≤ r 2 . We say that G is an (m,n; k) -factor graph if for each disjoint pair E1, E2 ⊆ E(G) with |E1| = m and |E2| = n , G has a k -factor F such that E1 ⊆ E(F ) and E2 ∩E(F ) = ∅ . In this note we consider when G is an (m,n; k) -factor g...
متن کاملRegular factors in regular graphs
Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...
متن کاملRegular Factors in Graphs
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. Preface Many fields of mathematics are concerned with determining the smallest parts, or factors, of a certain kind, which make up a given object. Probably the best known examples in mathematics are the factorization of non-negative integers with prime numbers or the decomposition of polynomials. It was a pr...
متن کاملOn k-Walk-Regular Graphs
Considering a connected graph G with diameter D, we say that it is k-walk-regular, for a given integer k (0 ≤ k ≤ D), if the number of walks of length l between vertices u and v only depends on the distance between them, provided that this distance does not exceed k. Thus, for k = 0, this definition coincides with that of walk-regular graph, where the number of cycles of length l rooted at a gi...
متن کاملRegular Factors of Regular Graphs from Eigenvalues
Let r and m be two integers such that r > m. Let H be a graph with order |H|, size e and maximum degree r such that 2e > |H|r−m. We find a best lower bound on spectral radius of graph H in terms of m and r. Let G be a connected r-regular graph of order |G| and k < r be an integer. Using the previous results, we find some best upper bounds (in terms of r and k) on the third largest eigenvalue th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00191-x